Frequent Representations
نویسنده
چکیده
Given a unitary representation T of a finite group G in C, write M for the variety of such representations which are unitary equivalent to T . The representation T is said to be frequent if the dimension of the variety M is maximal (among all representations of G in the same complex space). We prove that the irreducible representations are distributed, in the frequent representation (of large dimension), asymptotically in the same way as in the fundamental representation in the space of functions on G: the frequencies of the irreducible components are proportional to their dimensions. 2000 Math. Subj. Class. Primary 20Cxx; Secondary 11N37.
منابع مشابه
Trends and characteristics of short-term and frequent representations to emergency departments: A population-based study from New South Wales, Australia.
OBJECTIVE The objective of this study is to describe the trends and characteristics of short-term and frequent representations to EDs in New South Wales, Australia. METHODS This was a retrospective analysis of a linked population-based registry of ED representations in New South Wales, conducted as part of the Demand for Emergency Services in Years 2010-2014 project. Trend analysis of unplann...
متن کاملTransaction Databases, Frequent Itemsets, and Their Condensed Representations
Mining frequent itemsets is a fundamental task in data mining. Unfortunately the number of frequent itemsets describing the data is often too large to comprehend. This problem has been attacked by condensed representations of frequent itemsets that are subcollections of frequent itemsets containing only the frequent itemsets that cannot be deduced from other frequent itemsets in the subcollecti...
متن کاملA Survey on Condensed Representations for Frequent Sets
Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific problem of frequent set mining from potentially huge boolean matrices has given rise to tens of efficient solvers. Frequent sets are indeed useful for many data mining tasks, including the popular association rule mining task ...
متن کاملMinimal k-Free Representations of Frequent Sets
Due to the potentially immense amount of frequent sets that can be generated from transactional databases, recent studies have demonstrated the need for concise representations of all frequent sets. These studies resulted in several successful algorithms that only generate a lossless subset of the frequent sets. In this paper, we present a unifying framework encapsulating most known concise rep...
متن کاملNon-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation
The discovery of frequent patterns has attracted a lot of attention of the data mining community. While an extensive research has been carried out for discovering positive patterns, little has been offered for discovering patterns with negation. The main hindrance to the progress of such research is huge amount of frequent patterns with negation, which exceeds the number of frequent positive pa...
متن کاملItemset Support Queries Using Frequent Itemsets and Their Condensed Representations
The purpose of this paper is two-fold: First, we give efficient algorithms for answering itemset support queries for collections of itemsets from various representations of the frequency information. As index structures we use itemset tries of transaction databases, frequent itemsets and their condensed representations. Second, we evaluate the usefulness of condensed representations of frequent...
متن کامل